An improved homomorphism preservation theorem from lower bounds in circuit complexity
نویسندگان
چکیده
منابع مشابه
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi [GP14], where the circuits comprising the proof come from various restricted algebraic circuit classes. This mimics an established research direction in the boolean setting for subsystems of Extended Frege proofs, where proof-lines are ci...
متن کاملCircuit Lower Bounds Collapse Relativized Complexity Classes
Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to construct oracles that collapse complexity classes. For example, based on H astad's parity lower bound, ...
متن کاملCircuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds
This invited Descriptional Complexity of Formal Systems lecture provides an opportunity to raise awareness of the tight connection that exists between Kolmogorov Complexity and Circuit Complexity, and to argue that this connection is useful and interesting. Kolmogorov complexity has been used to provide examples of complete sets for classes such as EXP and PSPACE that are fundamentally differen...
متن کاملLocality from Circuit Lower Bounds
We study the locality of an extension of first-order logic that captures graph queries computable in AC, i.e., by families of polynomial-size constant-depth circuits. The extension considers first-order formulas over relational structures which may use arbitrary numerical predicates in such a way that their truth value is independent of the particular interpretation of the numerical predicates....
متن کاملThe Fusion Method for Lower Bounds in Circuit Complexity
This paper coins the term “The Fusion Method” to a recent approach for proving circuit lower bounds. It describes the method and surveys its achievements, potential and challenges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGLOG News
سال: 2016
ISSN: 2372-3491
DOI: 10.1145/3026744.3026746